Shape Recognition using the Least Squares Approximation

نویسندگان

  • Nacéra Laiche
  • Slimane Larabi
چکیده

This paper represents a novel algorithm to represent and recognize two dimensional curve based on its convex hull and the Least-Squared modeling. It combines the advantages of the property of the convex hulls that are particularly suitable for affine matching as they are affine invariant and the geometric properties of a contour that make it more or less identifiable. The description scheme and the similarity measure developed take into consideration technique for shape similarity. According to this method, the contours are extracted and decomposed into portions of curves. Each portion curve is approximated by some explicit curve using the Least Squares approximation. The obtained cubic curves are normalized in order to make the method invariant to scale change. Finally the resulting curves are used to compare and to compute similarity between shapes in images database using the Hausdorff distance. The proposed algorithm has been tested and its performance is found favourable as compared to other matching techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

Numerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials

The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...

متن کامل

OPTIMAL SHAPE DESIGN OF GRAVITY DAMS BASED ON A HYBRID META-HERURISTIC METHOD AND WEIGHTED LEAST SQUARES SUPPORT VECTOR MACHINE

A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO...

متن کامل

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012